<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Library Evolutionary Algorithms for Clustering (LEAC): include/graph_utils.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="leac_logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Library Evolutionary Algorithms for Clustering (LEAC)
   &#160;<span id="projectnumber">Version 1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">graph_utils.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="graph__utils_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#ifndef GRAPH_UTILS_HPP</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#define GRAPH_UTILS_HPP</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#include &lt;set&gt;</span> </div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#include &lt;list&gt;</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include &lt;map&gt;</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span> <span class="comment">//std::numeric_limits</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="matrix__triangular_8hpp.html">matrix_triangular.hpp</a>&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="instance_8hpp.html">instance.hpp</a>&quot;</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="disjsets_8hpp.html">disjsets.hpp</a>&quot;</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="common_8hpp.html">common.hpp</a>&quot;</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="insertion__operator_8hpp.html">insertion_operator.hpp</a>&quot;</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="verbose__global_8hpp.html">verbose_global.hpp</a>&quot;</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacegraph.html">graph</a> {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;  </div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">   43</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">enum</span> {<a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a>=0, <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea">VERTEXSTATE_GRAY</a>=1, <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275">VERTEXSTATE_BLACK</a>=2} <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7">GraphStateVertex</a>;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html">   50</a></span>&#160;<span class="keyword">class </span><a class="code" href="classgraph_1_1_algorithms_d_f_s.html">AlgorithmsDFS</a></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;{</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a9f4f60b91180462e41c623a6a788c771">   53</a></span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a9f4f60b91180462e41c623a6a788c771">AlgorithmsDFS</a>(std::vector&lt;std::list&lt;uintidx&gt; &gt; &amp;aivectorlistadj_g)</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;  : <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>(aivectorlistadj_g)</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;  , <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>(aivectorlistadj_g.size()) </div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;  , <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>(aivectorlistadj_g.size())</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;  , <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">f</a>(aivectorlistadj_g.size())</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;  , <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>(aivectorlistadj_g.size())</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;  {</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;   </div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;  }</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a80e1be25ca50e5fbcd02a6f80c92e5cf">   63</a></span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a80e1be25ca50e5fbcd02a6f80c92e5cf">~AlgorithmsDFS</a>() {} </div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a00ad2bd569078a26fdeafa39ec07bcf6">   65</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a00ad2bd569078a26fdeafa39ec07bcf6">resolve</a>() </div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;  {</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_numVertex = (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>.size();</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_ui = 0; luintidx_ui &lt; luintidx_numVertex; luintidx_ui++ ) { </div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[luintidx_ui]   = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a>;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;  </div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    }</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a> = 0;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;   </div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;   <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> u = 0; u &lt; luintidx_numVertex; u++ ) { </div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;      <span class="keywordflow">if</span> ( <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[u] == <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a> )</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">dfs_visit</a>(u);</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;   }</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;  }</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;  </div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#abe1b25e993493e8a7d7afeeda47e9680">   81</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#abe1b25e993493e8a7d7afeeda47e9680">resolve</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aiui_vertexU)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;  {</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_numVertex = </div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;      (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>.size();</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_ui = 0; luintidx_ui &lt; luintidx_numVertex; luintidx_ui++ ) { </div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[luintidx_ui]   = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a>;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>; </div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">f</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;  </div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;  </div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a> = 0;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">dfs_visit</a>(aiui_vertexU);</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;   </div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;  }</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">   97</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">dfs_visit</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aiui_vertexU)</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;  {</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[aiui_vertexU] = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea">VERTEXSTATE_GRAY</a>;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    ++<a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a>;</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>[aiui_vertexU] = <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a>;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;   </div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    std::list&lt;uintidx&gt; &amp;lvectorvertexidx_adj =  <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>[aiui_vertexU]; </div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    <span class="comment">/*Obtain the list of vertices adjacent to aiui_vertexU</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;<span class="comment">     lui_vertexV is a vertex adjacent to aiui_vertexU</span></div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="comment">    */</span></div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <span class="keywordflow">for</span> (<span class="keyword">auto</span> lui_vertexV: lvectorvertexidx_adj) { </div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;      <span class="keywordflow">if</span> ( <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[lui_vertexV] == <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a> ) {</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>[lui_vertexV] = aiui_vertexU;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">dfs_visit</a>(lui_vertexV);</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;      }</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    }</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>[aiui_vertexU] = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275">VERTEXSTATE_BLACK</a>;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    ++<a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a>;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">f</a>[aiui_vertexU] = <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a>;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;  }</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;  </div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;  <span class="comment">/*getVertexReachable:</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;  std::list&lt;uintidx&gt;</div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a2218b5467e8c8ac1b655bf758c501628">  122</a></span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a2218b5467e8c8ac1b655bf758c501628">getVertexReachable</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aiui_vertexU)</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;  {</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    ++geiinparam_verbose;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;      std::cout &lt;&lt; <span class="stringliteral">&quot;AlgorithmsDFS::getVertexReachable:  IN&quot;</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                &lt;&lt; <span class="stringliteral">&quot;\n\t( input uintidx aiui_vertexU: aiui_vertexU = &quot;</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                &lt;&lt; aiui_vertexU</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                &lt;&lt; std::endl;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    }</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    std::list&lt;uintidx&gt; lolistvertexidx_reachable;</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_numVertices = </div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;      (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>.size();</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    </div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;    this-&gt;<a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a00ad2bd569078a26fdeafa39ec07bcf6">resolve</a>(aiui_vertexU);</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_ui = 0; luintidx_ui &lt; lui_numVertices; luintidx_ui++ ) {</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;      <span class="keywordflow">if</span> (<a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>[luintidx_ui] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a> ) {</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        lolistvertexidx_reachable.push_back(luintidx_ui);</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;      } </div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;    }</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;      std::cout &lt;&lt; <span class="stringliteral">&quot;AlgorithmsDFS::getVertexReachable: OUT&quot;</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                &lt;&lt; <span class="stringliteral">&quot;\noutput std::list&lt;uintidx&gt; lolistvertexidx_reachable[&quot;</span> </div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                &lt;&lt; &amp;lolistvertexidx_reachable &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                &lt;&lt; lolistvertexidx_reachable</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                &lt;&lt; std::endl;</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    }</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    --geiinparam_verbose;</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;    <span class="keywordflow">return</span> lolistvertexidx_reachable;</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;  }</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;</div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a372cb2714c1489ac73f61f4250a61fab">  164</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a372cb2714c1489ac73f61f4250a61fab">print</a>() </div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;  {</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> = 0; <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> &lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>.size(); <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>++) {</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;      std::cout &lt;&lt; <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> &lt;&lt; <span class="stringliteral">&quot;:\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] </div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">f</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    }</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;  }</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">  173</a></span>&#160;  std::vector&lt;std::list&lt;uintidx&gt; &gt;   &amp;<a class="code" href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">_vectorlistadj_g</a>;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;  <span class="comment">//Establish if the vertex was visited</span></div><div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">  175</a></span>&#160;  std::vector&lt;GraphStateVertex&gt;      <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">_vectorenum_color</a>;</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;  <span class="comment">//Stores parent vertices</span></div><div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">  177</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">_vectorvertexidx_pi</a>;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;  <span class="comment">//Final time to know the vertex parent</span></div><div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">  179</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">f</a>;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;  <span class="comment">//￼Initial time to know the vertex parent</span></div><div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">  181</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">d</a>; </div><div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">  182</a></span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>                            <a class="code" href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">_uintidx_time</a>;</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    </div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;}; <span class="comment">/*class AlgorithmsDFS*/</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_BITSIZE &gt;</div><div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html">  193</a></span>&#160;<span class="keyword">class </span><a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html">AlgorithmsDFSAdjMatrix</a></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;{</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00196"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2d8e2ac9fdc2b95f87531b2e7ea7d416">  196</a></span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2d8e2ac9fdc2b95f87531b2e7ea7d416">AlgorithmsDFSAdjMatrix</a>(<a class="code" href="classmat_1_1_bit_matrix.html">mat::BitMatrix&lt;T_BITSIZE&gt;</a> &amp;aibitmatrixadj_g)</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    : <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>(aibitmatrixadj_g)</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;    , <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>(aibitmatrixadj_g.getNumRows()) </div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;    , <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>(aibitmatrixadj_g.getNumRows())</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;    , <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">f</a>(aibitmatrixadj_g.getNumRows())</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;    , <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">d</a>(aibitmatrixadj_g.getNumRows())</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;  {</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;  }</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;</div><div class="line"><a name="l00205"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#acd9fb7e8c9213926e491ccf938bd957e">  205</a></span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#acd9fb7e8c9213926e491ccf938bd957e">~AlgorithmsDFSAdjMatrix</a>() {} </div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;  </div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2719f4a788cf7c91e7dfad11bdb727f5">  207</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2719f4a788cf7c91e7dfad11bdb727f5">resolve</a>() </div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;  {</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_ui = 0;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;          luintidx_ui &lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>.getNumRows();</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;          luintidx_ui++ )</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;      { </div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>[luintidx_ui] = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a>;</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>; </div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">f</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;  </div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">d</a>[luintidx_ui] = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;  </div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;      }</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a> = 0;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_ui = 0;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;          luintidx_ui &lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>.getNumRows();</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;          luintidx_ui++ )</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;      { </div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="keywordflow">if</span> ( <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>[luintidx_ui] == <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a> ) {</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;          <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac495ab3d45479f2601c76d4648f556ef">dfs_visit</a>(luintidx_ui);</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        }</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;      }</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;  }</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;  </div><div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac495ab3d45479f2601c76d4648f556ef">  229</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac495ab3d45479f2601c76d4648f556ef">dfs_visit</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aiui_vertexU)</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;  {  </div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>[aiui_vertexU] = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea">VERTEXSTATE_GRAY</a>;</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;    ++<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a>;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">d</a>[aiui_vertexU] = <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a>;</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    <span class="comment">//The list of adjacent to the u vertex is obtained </span></div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;   </div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_vi = 0;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;          luintidx_vi &lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>.getNumColumns();</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;          luintidx_vi++ )</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;      {</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;      <span class="keywordflow">if</span> ( <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>(aiui_vertexU,luintidx_vi) ) {</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keywordflow">if</span> ( <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>[luintidx_vi] == <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a> ) {</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;          <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>[luintidx_vi] = aiui_vertexU;</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;          <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac495ab3d45479f2601c76d4648f556ef">dfs_visit</a>(luintidx_vi);</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        }</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;      }</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;      <span class="comment">// v is a vertex a u</span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;    }</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>[aiui_vertexU] = <a class="code" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275">VERTEXSTATE_BLACK</a>;</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;    ++<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a>;</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;    <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">f</a>[aiui_vertexU] = <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a>;</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;  }</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;</div><div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a1d08c0e3528b828a92f39a03d290f0f9">  254</a></span>&#160;  std::vector&lt;uintidx&gt;&amp;  <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a1d08c0e3528b828a92f39a03d290f0f9">getPi</a>()</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;  {</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>; </div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;  }</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;  </div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;  </div><div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a8c85f7e1dab1cedd4fc951fd424d28bb">  260</a></span>&#160;  <span class="keywordtype">void</span> <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a8c85f7e1dab1cedd4fc951fd424d28bb">print</a>() </div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;  {</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;    <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> = 0; <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> &lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>.size(); <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>++) {</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;      std::cout &lt;&lt; <a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a> &lt;&lt; <span class="stringliteral">&quot;:\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] </div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;                &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">d</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">f</a>[<a class="code" href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">li_i</a>] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;    }</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;  }</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;</div><div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">  269</a></span>&#160;  <a class="code" href="classmat_1_1_bit_matrix.html">mat::BitMatrix&lt;T_BITSIZE&gt;</a>           &amp;<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">_bitmatrixadj_g</a>;</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;  <span class="comment">//Establish if the vertex was visited</span></div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">  271</a></span>&#160;  std::vector&lt;GraphStateVertex&gt;      <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">_vectorenum_color</a>;</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;  <span class="comment">//Stores parent vertices</span></div><div class="line"><a name="l00273"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">  273</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">_vectorvertexidx_pi</a>;</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;  <span class="comment">//Final time to know the vertex parent</span></div><div class="line"><a name="l00275"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">  275</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">f</a>;</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;  <span class="comment">//￼Initial time to know the vertex parent</span></div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">  277</a></span>&#160;  std::vector&lt;uintidx&gt;               <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">d</a>; </div><div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">  278</a></span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>                            <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">_uintidx_time</a>;</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;}; <span class="comment">/*class AlgorithmsDFSAdjMatrix*/</span></div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;std::map&lt; uintidx, std::list&lt;uintidx&gt; &gt; </div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;<a class="code" href="namespacegraph.html#a075ef41b092e4421e4d890b34b11b399">fromPiToGraphMap</a></div><div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="namespacegraph.html#a075ef41b092e4421e4d890b34b11b399">  289</a></span>&#160;(<span class="keyword">const</span> std::vector&lt;uintidx&gt; &amp;aivectorvertexidx_pi </div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;)</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;{</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;graph::fromPiToGraphMap:  IN&quot;</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n( input std::vector&lt;uintidx&gt;: &amp;aivectorvertexidx_pi[&quot;</span></div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;              &lt;&lt; &amp;aivectorvertexidx_pi &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n)&quot;</span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;  }</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;  std::map&lt;uintidx,std::list&lt;uintidx&gt; &gt; lomaplistadj_g;</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;  </div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_numVertices = (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) aivectorvertexidx_pi.size();</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;  </div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;  <span class="keywordflow">for</span> (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_u = 0; luintidx_u &lt; lui_numVertices; luintidx_u++) {</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;    </div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;    <span class="keywordflow">if</span> ( aivectorvertexidx_pi[luintidx_u] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>) {</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;      </div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;      <span class="keyword">typename</span> std::map&lt;uintidx,std::list&lt;uintidx&gt; &gt;::iterator lconstit_listAdj =</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;        lomaplistadj_g.find(aivectorvertexidx_pi[luintidx_u]);</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;      </div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;      <span class="keywordflow">if</span> ( lconstit_listAdj != lomaplistadj_g.end() ) {</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        </div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        lconstit_listAdj-&gt;second.push_back(luintidx_u);</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        </div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;      }</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;      <span class="keywordflow">else</span> {</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;        std::list&lt;uintidx&gt; llist_vertidx(1,luintidx_u); </div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        lomaplistadj_g.insert</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;          ( std::pair&lt;<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>,std::list&lt;uintidx&gt; &gt;</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;            (aivectorvertexidx_pi[luintidx_u],llist_vertidx)</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;            );</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;      }</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;    }</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;  }</div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_label = <span class="stringliteral">&quot;graph::fromPiToGraphMap: OUT&quot;</span>;    </div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;    std::cout &lt;&lt; lpc_label</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\nstd::map&lt;uintidx,std::list&lt;uintidx&gt; &gt; lomaplistadj_g[&quot;</span> </div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;              &lt;&lt; &amp;lomaplistadj_g &lt;&lt; <span class="stringliteral">&quot;]&quot;</span></div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;  }</div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;</div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;  <span class="keywordflow">return</span> lomaplistadj_g;</div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;  </div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;}</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_VERTEX_IDX &gt;</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt;</div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;<a class="code" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">fromPiToGraph</a></div><div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">  355</a></span>&#160;(<span class="keyword">const</span> std::vector&lt;T_VERTEX_IDX&gt; &amp;aivectorvertexidx_pi)</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;{</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;  </div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;graph::fromPiToGraph:  IN&quot;</span></div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t( input std::vector&lt;T_VERTEX_IDX&gt;: &amp;aivectorvertexidx_pi[&quot;</span></div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;              &lt;&lt; &amp;aivectorvertexidx_pi &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;  }</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES*/</span></div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;  </div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;  std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt;</div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;    lovectorlistadj_g</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;    (aivectorvertexidx_pi.size(),</div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;     std::list&lt;T_VERTEX_IDX&gt;(0)</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;     );</div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;  T_VERTEX_IDX lui_numVertices = (T_VERTEX_IDX) aivectorvertexidx_pi.size();</div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;</div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;  <span class="keywordflow">for</span> (T_VERTEX_IDX luintidx_u = 0; luintidx_u &lt; lui_numVertices; luintidx_u++) {</div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;    <span class="keywordflow">if</span> ( aivectorvertexidx_pi[luintidx_u] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>) { </div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;      lovectorlistadj_g[aivectorvertexidx_pi[luintidx_u]].push_back(luintidx_u);</div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;    }</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;  }</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;  </div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;graph::fromPiToGraph: OUT&quot;</span></div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\noutput std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt; lovectorlistadj_g[&quot;</span> </div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;              &lt;&lt; &amp;lovectorlistadj_g &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;  }</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;  <span class="keywordflow">return</span> lovectorlistadj_g;</div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;  </div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;}</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;</div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_VERTEX_IDX,</div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;           <span class="keyword">typename</span> T_BITSIZE</div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;           &gt;</div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt;</div><div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;<a class="code" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">fromPiToGraph</a></div><div class="line"><a name="l00410"></a><span class="lineno"><a class="line" href="namespacegraph.html#a7ee0d63533a6004717575b5e8aec5c7d">  410</a></span>&#160;(<span class="keyword">const</span> std::vector&lt;T_VERTEX_IDX&gt;     &amp;aivectorvertexidx_pi,</div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160; <span class="keyword">const</span> <a class="code" href="classmat_1_1_bit_array.html">mat::BitArray&lt;T_BITSIZE&gt;</a>      &amp;aibitarray_edgeRemains</div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160; )</div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;{</div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;graph::fromPiToGraph:  IN&quot;</span></div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t( input std::vector&lt;T_VERTEX_IDX&gt;: &amp;aivectorvertexidx_pi[&quot;</span></div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;              &lt;&lt; &amp;aivectorvertexidx_pi &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t input  mat::BitArray&lt;T_BITSIZE&gt;: &amp;aibitarray_edgeRemains [&quot;</span> </div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;              &lt;&lt; &amp;aibitarray_edgeRemains &lt;&lt; <span class="charliteral">&#39;]&#39;</span> </div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;  }</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;</div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;  std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt;</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;    lovectorlistadj_g</div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;    (aivectorvertexidx_pi.size(),</div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;     std::list&lt;T_VERTEX_IDX&gt;(0)</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;     );</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;  T_VERTEX_IDX lui_numVertices = (T_VERTEX_IDX) aivectorvertexidx_pi.size();</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;  </div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  luintidx_numEdge = 0;</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;  <span class="keywordflow">for</span> (T_VERTEX_IDX luintidx_u = 0; luintidx_u &lt; lui_numVertices; luintidx_u++) {</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;    <span class="keywordflow">if</span> ( aivectorvertexidx_pi[luintidx_u] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>) { </div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;      <span class="keywordflow">if</span> ( !aibitarray_edgeRemains.<a class="code" href="classds_1_1_bit_container.html#ac411be8a6a028077107ab9c7a60b5546">getBit</a>(luintidx_numEdge) ) { </div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;        lovectorlistadj_g[aivectorvertexidx_pi[luintidx_u]].push_back(luintidx_u);</div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;      }</div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;      ++luintidx_numEdge;</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;    }</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;  }</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;  </div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;graph::fromPiToGraph: OUT&quot;</span></div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\noutput std::vector&lt;std::list&lt;T_VERTEX_IDX&gt; &gt; lovectorlistadj_g[&quot;</span> </div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;              &lt;&lt; &amp;lovectorlistadj_g &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;    }</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;  <span class="keywordflow">return</span> lovectorlistadj_g;</div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;  </div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;}</div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;<a class="code" href="classds_1_1_disj_sets.html">ds::DisjSets</a> </div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;<a class="code" href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">component</a></div><div class="line"><a name="l00467"></a><span class="lineno"><a class="line" href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">  467</a></span>&#160;(<span class="keyword">const</span> std::vector&lt;uintidx&gt;  &amp;aivectoruintidx_vertexPi</div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160; )</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;{</div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelComponent = <span class="stringliteral">&quot;graph::component&quot;</span>;</div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;    std::cout &lt;&lt; lpc_labelComponent</div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t  input std::vector&lt;uintidx&gt; &amp;aivectoruintidx_vertexPi[&quot;</span> </div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;              &lt;&lt; &amp;aivectoruintidx_vertexPi &lt;&lt; <span class="charliteral">&#39;]&#39;</span> </div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;  }</div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;</div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  lui_numVertices = (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) aivectoruintidx_vertexPi.size();</div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  luintidx_numEdge;</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;  <a class="code" href="classds_1_1_disj_sets.html">ds::DisjSets</a> aiods_disjsets(lui_numVertices);</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;  luintidx_numEdge  = 0;</div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;  <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_i = 0; luintidx_i &lt; lui_numVertices; ++luintidx_i) {</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;    <span class="keywordflow">if</span> ( aivectoruintidx_vertexPi[luintidx_i] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a> )  { </div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;      <span class="keywordflow">if</span> ( aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a101eabf86f8a7f2e21f2c5c5329269eb">find</a>(aivectoruintidx_vertexPi[luintidx_i])</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;           != aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a101eabf86f8a7f2e21f2c5c5329269eb">find</a>(luintidx_i) )</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        {</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;          aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a045884be5b69816578fd42500ec91ebd">merge</a>(aivectoruintidx_vertexPi[luintidx_i], luintidx_i );</div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;        }</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;      ++luintidx_numEdge;</div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;    }</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;  }</div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;  </div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;  </div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {    </div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;    std::cout &lt;&lt; lpc_labelComponent</div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span>;   </div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;    aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a3eddb5e3a2f942314524d5f0edf181f0">print</a>(std::cout,lpc_labelComponent,<span class="charliteral">&#39;,&#39;</span>);  </div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;    std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;    </div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;  }</div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;  </div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;  <span class="keywordflow">return</span> aiods_disjsets;</div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;  </div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;}</div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;</div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_BITSIZE &gt;</div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;<a class="code" href="classds_1_1_disj_sets.html">ds::DisjSets</a> </div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;<a class="code" href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">component</a></div><div class="line"><a name="l00525"></a><span class="lineno"><a class="line" href="namespacegraph.html#a2f98b0ea6d3e2aa3816884cdf0cc2277">  525</a></span>&#160;(<span class="keyword">const</span> std::vector&lt;uintidx&gt;      &amp;aivectoruintidx_vertexPi,</div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160; <span class="keyword">const</span> <a class="code" href="classmat_1_1_bit_array.html">mat::BitArray&lt;T_BITSIZE&gt;</a>  &amp;aibitarray_edgeRemains</div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160; )</div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;{</div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelComponent = <span class="stringliteral">&quot;graph::component&quot;</span>;</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;    std::cout &lt;&lt; lpc_labelComponent</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t  input std::vector&lt;uintidx&gt; &amp;aivectoruintidx_vertexPi[&quot;</span> </div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;              &lt;&lt; &amp;aivectoruintidx_vertexPi &lt;&lt; <span class="charliteral">&#39;]&#39;</span> </div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;  }</div><div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;</div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  lui_numVertices = (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) aivectoruintidx_vertexPi.size();</div><div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;  <a class="code" href="classds_1_1_disj_sets.html">ds::DisjSets</a> aiods_disjsets(lui_numVertices);</div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;</div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  lui_numEdges  = 0;</div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;  <span class="keywordflow">for</span> ( <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_i = 0; luintidx_i &lt; lui_numVertices; ++luintidx_i) {</div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;    <span class="keywordflow">if</span> ( aivectoruintidx_vertexPi[luintidx_i] != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a> )  {</div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;      <span class="keywordflow">if</span> ( !aibitarray_edgeRemains.<a class="code" href="classds_1_1_bit_container.html#ac411be8a6a028077107ab9c7a60b5546">getBit</a>(lui_numEdges) ) {</div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;        <span class="keywordflow">if</span> ( aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a101eabf86f8a7f2e21f2c5c5329269eb">find</a>(aivectoruintidx_vertexPi[luintidx_i])</div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;             != aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a101eabf86f8a7f2e21f2c5c5329269eb">find</a>(luintidx_i) )</div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;          aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a045884be5b69816578fd42500ec91ebd">merge</a>(aivectoruintidx_vertexPi[luintidx_i], luintidx_i );</div><div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;      }</div><div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;      ++lui_numEdges;</div><div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;    }</div><div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;  }</div><div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;  </div><div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;  </div><div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;   </div><div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;    std::cout &lt;&lt; lpc_labelComponent</div><div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\noutput std::vector&lt;std::list&lt;uintidx&gt; &gt; aiods_disjsets[&quot;</span> </div><div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;              &lt;&lt; &amp;aiods_disjsets</div><div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;    </div><div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;    aiods_disjsets.<a class="code" href="classds_1_1_disj_sets.html#a3eddb5e3a2f942314524d5f0edf181f0">print</a>(std::cout,lpc_labelComponent,<span class="charliteral">&#39;,&#39;</span>);</div><div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;        </div><div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;    std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;    </div><div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;  }</div><div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;  </div><div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;  <span class="keywordflow">return</span> aiods_disjsets;</div><div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;  </div><div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;}</div><div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;</div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;</div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_W &gt;  </div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;std::vector&lt;uintidx&gt; </div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;<a class="code" href="namespacegraph.html#a297cbabf753f01d6b237bec48484798e">prim</a></div><div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="namespacegraph.html#a297cbabf753f01d6b237bec48484798e">  589</a></span>&#160;(<span class="keyword">const</span> <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_W&gt;</a> &amp;aimatrixtriagt_w,</div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160; <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>                lui_startVertex = 0</div><div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160; ) </div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;{</div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;graph::prim:&quot;</span>;</div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t( input mat::MatrixTriang&lt;T_W&gt;: &amp;aimatrixtriagt_w = [&quot;</span></div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;              &lt;&lt; &amp;aimatrixtriagt_w &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t input  uintidx lui_startVertex = &quot;</span> &lt;&lt; lui_startVertex</div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n\t)&quot;</span></div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;  }</div><div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;</div><div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;  std::set&lt;std::pair&lt;T_W,uintidx&gt; &gt;    lset_Q;</div><div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;  std::vector&lt;uintidx&gt;                 </div><div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;    lovectoruintidx_pi(aimatrixtriagt_w.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>(), <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>);</div><div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;  std::vector&lt;std::pair&lt;T_W,uintidx&gt; &gt; lvector_temp;</div><div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;</div><div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;  lvector_temp.reserve(aimatrixtriagt_w.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>());</div><div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;  <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_numVertices = (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>) aimatrixtriagt_w.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>();</div><div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;  </div><div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;  <span class="keywordflow">for</span> (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_i = 0; luintidx_i &lt; lui_numVertices; luintidx_i++) {</div><div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;    lset_Q.insert(std::make_pair(std::numeric_limits&lt;T_W&gt;::max(),luintidx_i));</div><div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;  }</div><div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;  </div><div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;  lset_Q.erase(lset_Q.find(std::make_pair(std::numeric_limits&lt;T_W&gt;::max(),lui_startVertex)));</div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;  lset_Q.insert(std::make_pair(T_W(0),lui_startVertex));</div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;  </div><div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;  <span class="keywordflow">while</span> ( !lset_Q.empty() ) {</div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;    std::pair&lt;uintidx,T_W&gt; lpair_u = *lset_Q.begin();</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;    lset_Q.erase(lset_Q.begin()); </div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;      </div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;    lvector_temp.clear();</div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;    <span class="keywordflow">for</span> ( <span class="keyword">auto</span>  lpair_v: lset_Q ) {</div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;</div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;      <span class="keywordflow">if</span> ( aimatrixtriagt_w(lpair_u.second,lpair_v.second) &lt; lpair_v.first ) {</div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        lvector_temp.push_back(lpair_v);</div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        lovectoruintidx_pi[lpair_v.second] = lpair_u.second;</div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;      }</div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;    }</div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;    <span class="keywordflow">for</span> ( <span class="keyword">auto</span>  lpair_v: lvector_temp) {</div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;      lset_Q.erase(lset_Q.find(lpair_v));</div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;      lpair_v.first = aimatrixtriagt_w(lpair_u.second,lpair_v.second);</div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;      lset_Q.insert(lpair_v);</div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;    }</div><div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;</div><div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;  }</div><div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;  </div><div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;</div><div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\noutput vector&lt;uintidx&gt; lovectoruintidx_pi[&quot;</span></div><div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;              &lt;&lt; &amp;lovectoruintidx_pi &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div><div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;  </div><div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;    <span class="keywordflow">if</span> ( lui_numVertices &gt; 0 ) {</div><div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;      <span class="keywordflow">for</span> (<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> luintidx_v = 0; luintidx_v &lt; lui_numVertices-1; luintidx_v++) {</div><div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        std::cout &lt;&lt; luintidx_v &lt;&lt; <span class="charliteral">&#39;,&#39;</span> &lt;&lt; lovectoruintidx_pi[luintidx_v] &lt;&lt; <span class="charliteral">&#39;;&#39;</span>;</div><div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;      }</div><div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;      std::cout &lt;&lt; lui_numVertices-1 &lt;&lt; <span class="charliteral">&#39;,&#39;</span> &lt;&lt; lovectoruintidx_pi[lui_numVertices-1] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;    }</div><div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;    std::ostringstream lostrstream_labelGraph;</div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;   lostrstream_labelGraph &lt;&lt; <span class="stringliteral">&quot;&lt;GRAPH:&quot;</span> &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;  </div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;    std::vector&lt;std::list&lt;uintidx&gt; &gt;&amp;&amp; lvectorlist_graph = </div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;      <a class="code" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">fromPiToGraph</a></div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;      (lovectoruintidx_pi);</div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;</div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;    <a class="code" href="namespaceinout.html#aa6b4c6d9486a8bdbe21f6fa090f4c688">inout::vectorlistprint</a></div><div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;      (lvectorlist_graph,</div><div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;       std::cout,</div><div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;       lostrstream_labelGraph.str().c_str(),</div><div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;       <span class="charliteral">&#39;;&#39;</span></div><div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;       );</div><div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;    std::cout &lt;&lt; std::endl;   </div><div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;  }</div><div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;</div><div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;  <span class="keywordflow">return</span> lovectoruintidx_pi;</div><div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;</div><div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;} <span class="comment">/*prim*/</span></div><div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;</div><div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;</div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_BITSIZE,</div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;           <span class="keyword">typename</span> T_FEATURE,</div><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;           <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;           <span class="keyword">typename</span> INPUT_ITERATOR</div><div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;           &gt;</div><div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;<a class="code" href="classmat_1_1_bit_matrix.html">mat::BitMatrix&lt;T_BITSIZE&gt;</a> </div><div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;<a class="code" href="namespacegraph.html#a1a8c03e25337e6becb8d58b8e57e66fc">getAdjacencyMatrix</a></div><div class="line"><a name="l00694"></a><span class="lineno"><a class="line" href="namespacegraph.html#a1a8c03e25337e6becb8d58b8e57e66fc">  694</a></span>&#160;(<span class="keyword">const</span> T_DIST                    ait_distAdj,</div><div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160; INPUT_ITERATOR                  aiiterator_instfirst,</div><div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160; <span class="keyword">const</span> INPUT_ITERATOR            aiiterator_instlast,</div><div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160; <a class="code" href="structdist_1_1_dist.html">dist::Dist&lt;T_DIST,T_FEATURE&gt;</a>    &amp;aifunc2p_dist,</div><div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160; <span class="keyword">const</span> T_BITSIZE                 aii_datatypeBitSize = 0</div><div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;)</div><div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;{</div><div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160; <span class="keyword">const</span> <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  lui_numInstances =</div><div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;   <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>(std::distance(aiiterator_instfirst,aiiterator_instlast)); </div><div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;  <a class="code" href="classmat_1_1_bit_matrix.html">mat::BitMatrix&lt;T_BITSIZE&gt;</a> </div><div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;    lobitmatrix_adjacency</div><div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;    ( lui_numInstances,</div><div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;      lui_numInstances</div><div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;      );</div><div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;</div><div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;graph::getAdjacencyMatrix&quot;</span>;</div><div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;:  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span>      </div><div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n(input  T_DIST ait_distAdj = &quot;</span> &lt;&lt;  ait_distAdj</div><div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;input aiiterator_instfirst[&quot;</span> &lt;&lt; &amp;aiiterator_instfirst &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;input const aiiterator_instlast[&quot;</span> &lt;&lt; *aiiterator_instlast &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n input  dist::Dist&lt;T_DIST,T_FEATURE&gt; &amp;aifunc2p_dist[&quot;</span> </div><div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;              &lt;&lt; &amp;aifunc2p_dist &lt;&lt; <span class="charliteral">&#39;]&#39;</span> </div><div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n)&quot;</span></div><div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;  }</div><div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;</div><div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;  lobitmatrix_adjacency.<a class="code" href="classmat_1_1_bit_matrix.html#a3b57b2184fdf4bac7fb223e0f2d3353b">initialize</a>();</div><div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;</div><div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_i = 0;</div><div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;   <span class="keywordflow">for</span> (INPUT_ITERATOR literator_i = aiiterator_instfirst;</div><div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        literator_i != aiiterator_instlast; literator_i++, lui_i++) {</div><div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;     <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_j = 0;</div><div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;    <span class="keywordflow">for</span> (INPUT_ITERATOR literator_j = aiiterator_instfirst;</div><div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;         literator_j != aiiterator_instlast; literator_j++, lui_j++) {    </div><div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;      T_DIST lt_dij =  </div><div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;        aifunc2p_dist</div><div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        ((*literator_i)-&gt;getFeatures(),</div><div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;         (*literator_j)-&gt;getFeatures(),</div><div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;         <a class="code" href="classdata_1_1_instance.html#a90d1eaeb66cc1470bbfdb95434fdb761">data::Instance&lt;T_FEATURE&gt;::getNumDimensions</a>() </div><div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;         );</div><div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;      <span class="keywordflow">if</span> ( lt_dij &lt;= ait_distAdj )</div><div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;        lobitmatrix_adjacency.<a class="code" href="classmat_1_1_bit_matrix.html#a023483d27c6b66b43356d6f8b9cbaba8">setBit</a>(lui_i,lui_j);</div><div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;      </div><div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;    }</div><div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;  }</div><div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;</div><div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\nmat::BitMatrix&lt;T_BITSIZE&gt; lobitmatrix_adjacency[&quot;</span> </div><div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;              &lt;&lt; &amp;lobitmatrix_adjacency &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;              &lt;&lt; lobitmatrix_adjacency</div><div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;              &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;    std::ostringstream lostrstream_labelGraph;</div><div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;    lostrstream_labelGraph &lt;&lt; <span class="stringliteral">&quot;&lt;GRAPH:&quot;</span> &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;    </div><div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;    lobitmatrix_adjacency.<a class="code" href="classmat_1_1_bit_matrix.html#a00bc1c8502b8f7d4723656ff0a198a1a">print_listAdj</a></div><div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;      (std::cout,</div><div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;       lostrstream_labelGraph.str().c_str(),</div><div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;       <span class="charliteral">&#39;,&#39;</span>,</div><div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;       <span class="charliteral">&#39;;&#39;</span></div><div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;       );</div><div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;  }</div><div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;</div><div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;  <span class="keywordflow">return</span> lobitmatrix_adjacency;</div><div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;</div><div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;} <span class="comment">/*END getAdjacencyMatrix</span></div><div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160; </div><div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_REAL,</div><div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;           <span class="keyword">typename</span> T_FEATURE,</div><div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;           <span class="keyword">typename</span> T_CLUSTERIDX, <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;           <span class="keyword">typename</span> INPUT_ITERATOR</div><div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;           &gt;</div><div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;<a class="code" href="classpartition_1_1_partition_disj_sets.html">partition::PartitionDisjSets&lt;T_CLUSTERIDX&gt;</a></div><div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;<a class="code" href="namespacegraph.html#a45090d21efbff1f3bf9c762b9aa8e06d">nearestNeighbor</a></div><div class="line"><a name="l00787"></a><span class="lineno"><a class="line" href="namespacegraph.html#a45090d21efbff1f3bf9c762b9aa8e06d">  787</a></span>&#160;(<span class="keyword">const</span> T_REAL                    aitr_parameterU,</div><div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160; INPUT_ITERATOR                  aiiterator_instfirst,</div><div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160; <span class="keyword">const</span> INPUT_ITERATOR            aiiterator_instlast,</div><div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160; <a class="code" href="structdist_1_1_dist.html">dist::Dist&lt;T_REAL,T_FEATURE&gt;</a>    &amp;aifunc2p_dist,</div><div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160; <span class="keyword">const</span> T_CLUSTERIDX              aii_datatypeClusterIdx = 0</div><div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160; )</div><div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;{</div><div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;graph::nearestNeighbor&quot;</span>;</div><div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;:  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n(const input T_PARAMETER_REAL aitr_parameterU  = &quot;</span></div><div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;              &lt;&lt; aitr_parameterU</div><div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;input aiiterator_instfirst[&quot;</span> &lt;&lt; &amp;aiiterator_instfirst &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;input const aiiterator_instlast[&quot;</span> &lt;&lt; *aiiterator_instlast &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n input  dist::Dist&lt;T_REAL,T_FEATURE&gt; &amp;aifunc2p_dist[&quot;</span> </div><div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;              &lt;&lt; &amp;aifunc2p_dist &lt;&lt; <span class="charliteral">&#39;]&#39;</span></div><div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n)&quot;</span></div><div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;  }</div><div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;</div><div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;  <span class="comment">/*Step 1: For each object O , find the distance between</span></div><div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;<span class="comment">    Oi and its nearest neighbor. That is,</span></div><div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="comment">    d_nn(O_i)  = min_{j\ne i} ||O_j - O_i||,</span></div><div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;<span class="comment">  */</span></div><div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;  T_REAL lt_dav = T_REAL(0);</div><div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;  </div><div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;  <span class="keywordflow">for</span> (INPUT_ITERATOR literator_i = aiiterator_instfirst;</div><div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;       literator_i != aiiterator_instlast; literator_i++) {</div><div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;    T_REAL lt_dnn = std::numeric_limits&lt;T_REAL&gt;::max();</div><div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;    <span class="keywordflow">for</span> (INPUT_ITERATOR literator_j = aiiterator_instfirst;</div><div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;       literator_j != aiiterator_instlast; literator_j++) {</div><div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;      <span class="keywordflow">if</span> ( literator_i != literator_j ) {</div><div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;        T_REAL lt_dij = </div><div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;          aifunc2p_dist</div><div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;          ((*literator_i)-&gt;getFeatures(),</div><div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;           (*literator_j)-&gt;getFeatures(),</div><div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;           <a class="code" href="classdata_1_1_instance.html#a90d1eaeb66cc1470bbfdb95434fdb761">data::Instance&lt;T_FEATURE&gt;::getNumDimensions</a>() </div><div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;           );</div><div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        <span class="keywordflow">if</span> (lt_dij &lt; lt_dnn )</div><div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;          lt_dnn = lt_dij;</div><div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;      }</div><div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;    }</div><div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;    lt_dav += lt_dnn;</div><div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;  }</div><div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160; </div><div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;  <span class="comment">/*Step 2: Compute d , the average of the nearest-neighbor </span></div><div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;<span class="comment">    distances by using Eq. (1) as follows:</span></div><div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;<span class="comment">  */</span></div><div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;  lt_dav /= (T_REAL) <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>(std::distance(aiiterator_instfirst,aiiterator_instlast)); </div><div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;</div><div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;  T_REAL  lt_d = aitr_parameterU * lt_dav; </div><div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;  <span class="comment">/*Step 3: View the n objects as nodes of a graph. Compute </span></div><div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;<span class="comment">    the adjacency matrix A_{nxn} as follows:</span></div><div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="comment">  */</span></div><div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;  <span class="keyword">auto</span> &amp;&amp;lbitmatrix_adjacency =</div><div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;    <a class="code" href="namespacegraph.html#a1a8c03e25337e6becb8d58b8e57e66fc">getAdjacencyMatrix</a></div><div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;    (lt_d,</div><div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;     aiiterator_instfirst,</div><div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;     aiiterator_instlast,</div><div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;     aifunc2p_dist,</div><div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;     (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) 0</div><div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;     );</div><div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;</div><div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;  <span class="comment">/*Step 4:</span></div><div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;  <a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html">graph::AlgorithmsDFSAdjMatrix&lt;unsigned int&gt;</a></div><div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;    lalgdfsadjmatrix(lbitmatrix_adjacency);</div><div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;</div><div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;  lalgdfsadjmatrix.<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2719f4a788cf7c91e7dfad11bdb727f5">resolve</a>();</div><div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160; </div><div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;  <a class="code" href="classds_1_1_disj_sets.html">ds::DisjSets</a>  lodisjsets_componentSetBi = </div><div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;    <a class="code" href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">graph::component</a>(lalgdfsadjmatrix.<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a1d08c0e3528b828a92f39a03d290f0f9">getPi</a>());</div><div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;    </div><div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;  <a class="code" href="classpartition_1_1_partition_disj_sets.html">partition::PartitionDisjSets&lt;T_CLUSTERIDX&gt;</a></div><div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;    lomembclassdisjsets_Bi(std::move(lodisjsets_componentSetBi));</div><div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;  </div><div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span>;</div><div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;</div><div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;    std::cout &lt;&lt;  <span class="stringliteral">&quot;lt_dav = &quot;</span> &lt;&lt; lt_dav &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;    std::cout &lt;&lt;  <span class="stringliteral">&quot;lt_d = &quot;</span>   &lt;&lt; lt_d   &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;</div><div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;    std::ostringstream lostrstream_labelBi;</div><div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;    lostrstream_labelBi &lt;&lt; <span class="stringliteral">&quot;&lt;MEMBER Bi:CLASSDISJSETS_Bi&quot;</span> &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;    lomembclassdisjsets_Bi.print(std::cout,lostrstream_labelBi.str().c_str(),<span class="charliteral">&#39;,&#39;</span>);</div><div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;    std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;</div><div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;    std::vector&lt;std::list&lt;uintidx&gt; &gt; lvectorlist_tmpgraphpi =</div><div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;      <a class="code" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">graph::fromPiToGraph</a>(lalgdfsadjmatrix.<a class="code" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a1d08c0e3528b828a92f39a03d290f0f9">getPi</a>());</div><div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;    std::ostringstream lostrstream_labelGraphPi;</div><div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;    lostrstream_labelGraphPi &lt;&lt; <span class="stringliteral">&quot;&lt;GRAPH:PI:&quot;</span> &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;    <a class="code" href="namespaceinout.html#aa6b4c6d9486a8bdbe21f6fa090f4c688">inout::vectorlistprint</a></div><div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;      (lvectorlist_tmpgraphpi,</div><div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;       std::cout,lostrstream_labelGraphPi.str().c_str(),</div><div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;       <span class="charliteral">&#39;;&#39;</span></div><div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;       );</div><div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;    std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;  }</div><div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;</div><div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;  <span class="keywordflow">return</span> lomembclassdisjsets_Bi;</div><div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;</div><div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;} <span class="comment">/*END nearestNeighbor */</span></div><div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;</div><div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;} <span class="comment">/*END namespace graph*/</span></div><div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;</div><div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*GRAPH_UTILS_HPP*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;</div><div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a60a99f3a44ed14d047fe5cd9576f3236"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a60a99f3a44ed14d047fe5cd9576f3236">graph::AlgorithmsDFSAdjMatrix::_bitmatrixadj_g</a></div><div class="ttdeci">mat::BitMatrix&lt; T_BITSIZE &gt; &amp; _bitmatrixadj_g</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00269">graph_utils.hpp:269</a></div></div>
<div class="ttc" id="classpartition_1_1_partition_disj_sets_html"><div class="ttname"><a href="classpartition_1_1_partition_disj_sets.html">partition::PartitionDisjSets</a></div><div class="ttdoc">Partition of instances in base DisjSets data structure.</div><div class="ttdef"><b>Definition:</b> <a href="partition__disjsets_8hpp_source.html#l00037">partition_disjsets.hpp:37</a></div></div>
<div class="ttc" id="classmat_1_1_bit_matrix_html_a3b57b2184fdf4bac7fb223e0f2d3353b"><div class="ttname"><a href="classmat_1_1_bit_matrix.html#a3b57b2184fdf4bac7fb223e0f2d3353b">mat::BitMatrix::initialize</a></div><div class="ttdeci">void initialize()</div><div class="ttdef"><b>Definition:</b> <a href="bit__matrix_8hpp_source.html#l00129">bit_matrix.hpp:129</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a3522d046e986c173dd53f064193b20f3"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a3522d046e986c173dd53f064193b20f3">graph::AlgorithmsDFS::_vectorvertexidx_pi</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; _vectorvertexidx_pi</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00177">graph_utils.hpp:177</a></div></div>
<div class="ttc" id="classmat_1_1_bit_matrix_html_a00bc1c8502b8f7d4723656ff0a198a1a"><div class="ttname"><a href="classmat_1_1_bit_matrix.html#a00bc1c8502b8f7d4723656ff0a198a1a">mat::BitMatrix::print_listAdj</a></div><div class="ttdeci">void print_listAdj(std::ostream &amp;os=std::cout, const char *aipc_label=&quot;&quot;, const char aic_delimVert=',', const char aic_delimAdj=';') const</div><div class="ttdef"><b>Definition:</b> <a href="bit__matrix_8hpp_source.html#l00385">bit_matrix.hpp:385</a></div></div>
<div class="ttc" id="namespaceinout_html_aa6b4c6d9486a8bdbe21f6fa090f4c688"><div class="ttname"><a href="namespaceinout.html#aa6b4c6d9486a8bdbe21f6fa090f4c688">inout::vectorlistprint</a></div><div class="ttdeci">void vectorlistprint(const std::vector&lt; std::list&lt; T &gt; &gt; &amp;aivectorlist_g, std::ostream &amp;out=std::cout, const char *aipc_label=&quot;&quot;, const char aic_delimList=';')</div><div class="ttdef"><b>Definition:</b> <a href="container__out_8hpp_source.html#l00143">container_out.hpp:143</a></div></div>
<div class="ttc" id="classmat_1_1_bit_matrix_html_a023483d27c6b66b43356d6f8b9cbaba8"><div class="ttname"><a href="classmat_1_1_bit_matrix.html#a023483d27c6b66b43356d6f8b9cbaba8">mat::BitMatrix::setBit</a></div><div class="ttdeci">void setBit(uintidx i, uintidx j)</div><div class="ttdef"><b>Definition:</b> <a href="bit__matrix_8hpp_source.html#l00170">bit_matrix.hpp:170</a></div></div>
<div class="ttc" id="classmat_1_1_bit_matrix_html"><div class="ttname"><a href="classmat_1_1_bit_matrix.html">mat::BitMatrix</a></div><div class="ttdoc">Bit matrix.</div><div class="ttdef"><b>Definition:</b> <a href="bit__container_8hpp_source.html#l00029">bit_container.hpp:29</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a2d8e2ac9fdc2b95f87531b2e7ea7d416"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2d8e2ac9fdc2b95f87531b2e7ea7d416">graph::AlgorithmsDFSAdjMatrix::AlgorithmsDFSAdjMatrix</a></div><div class="ttdeci">AlgorithmsDFSAdjMatrix(mat::BitMatrix&lt; T_BITSIZE &gt; &amp;aibitmatrixadj_g)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00196">graph_utils.hpp:196</a></div></div>
<div class="ttc" id="namespacegraph_html_a075ef41b092e4421e4d890b34b11b399"><div class="ttname"><a href="namespacegraph.html#a075ef41b092e4421e4d890b34b11b399">graph::fromPiToGraphMap</a></div><div class="ttdeci">std::map&lt; uintidx, std::list&lt; uintidx &gt; &gt; fromPiToGraphMap(const std::vector&lt; uintidx &gt; &amp;aivectorvertexidx_pi)</div><div class="ttdoc">Constructs a list map graph from PI vertices for a Pi vector.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00289">graph_utils.hpp:289</a></div></div>
<div class="ttc" id="common_8hpp_html_a3f6c33fb604556cdc425e7aa2289d009"><div class="ttname"><a href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a></div><div class="ttdeci">uint32_t uintidx</div><div class="ttdef"><b>Definition:</b> <a href="common_8hpp_source.html#l00020">common.hpp:20</a></div></div>
<div class="ttc" id="common_8hpp_html_af3832ec3c2aad9eb797abf385e290d28"><div class="ttname"><a href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a></div><div class="ttdeci">static const uintidx UINTIDX_NIL</div><div class="ttdef"><b>Definition:</b> <a href="common_8hpp_source.html#l00025">common.hpp:25</a></div></div>
<div class="ttc" id="namespacegraph_html_a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea"><div class="ttname"><a href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea">graph::VERTEXSTATE_GRAY</a></div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00043">graph_utils.hpp:43</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a6371b1a664aef82d89866d651d5a00ea"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a6371b1a664aef82d89866d651d5a00ea">graph::AlgorithmsDFS::_uintidx_time</a></div><div class="ttdeci">uintidx _uintidx_time</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00182">graph_utils.hpp:182</a></div></div>
<div class="ttc" id="namespacegraph_html_a3844063f8ced6b7f416ff7b4cfd523c7"><div class="ttname"><a href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7">graph::GraphStateVertex</a></div><div class="ttdeci">GraphStateVertex</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00043">graph_utils.hpp:43</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_aa0d8cc2dad18bcee37a5a8f6528bf409"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#aa0d8cc2dad18bcee37a5a8f6528bf409">graph::AlgorithmsDFS::f</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; f</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00179">graph_utils.hpp:179</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a152cb6506648bd4f2a2c6eceae84f5b3"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a152cb6506648bd4f2a2c6eceae84f5b3">graph::AlgorithmsDFSAdjMatrix::f</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; f</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00275">graph_utils.hpp:275</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a372cb2714c1489ac73f61f4250a61fab"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a372cb2714c1489ac73f61f4250a61fab">graph::AlgorithmsDFS::print</a></div><div class="ttdeci">void print()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00164">graph_utils.hpp:164</a></div></div>
<div class="ttc" id="namespacegraph_html_a297cbabf753f01d6b237bec48484798e"><div class="ttname"><a href="namespacegraph.html#a297cbabf753f01d6b237bec48484798e">graph::prim</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; prim(const mat::MatrixTriang&lt; T_W &gt; &amp;aimatrixtriagt_w, const uintidx lui_startVertex=0)</div><div class="ttdoc">Prim’s algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00589">graph_utils.hpp:589</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_afb0c8ba21ad5ce2932d835cfd38ca334"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#afb0c8ba21ad5ce2932d835cfd38ca334">graph::AlgorithmsDFSAdjMatrix::_uintidx_time</a></div><div class="ttdeci">uintidx _uintidx_time</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00278">graph_utils.hpp:278</a></div></div>
<div class="ttc" id="namespacegraph_html_a45090d21efbff1f3bf9c762b9aa8e06d"><div class="ttname"><a href="namespacegraph.html#a45090d21efbff1f3bf9c762b9aa8e06d">graph::nearestNeighbor</a></div><div class="ttdeci">partition::PartitionDisjSets&lt; T_CLUSTERIDX &gt; nearestNeighbor(const T_REAL aitr_parameterU, INPUT_ITERATOR aiiterator_instfirst, const INPUT_ITERATOR aiiterator_instlast, dist::Dist&lt; T_REAL, T_FEATURE &gt; &amp;aifunc2p_dist, const T_CLUSTERIDX aii_datatypeClusterIdx=0)</div><div class="ttdoc">Nearest neighbor .</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00787">graph_utils.hpp:787</a></div></div>
<div class="ttc" id="classmat_1_1_bit_array_html"><div class="ttname"><a href="classmat_1_1_bit_array.html">mat::BitArray</a></div><div class="ttdoc">Bit array.</div><div class="ttdef"><b>Definition:</b> <a href="bit__array_8hpp_source.html#l00043">bit_array.hpp:43</a></div></div>
<div class="ttc" id="namespaceinout_html_a58988b65e7b78cbd7c509518c7baff7e"><div class="ttname"><a href="namespaceinout.html#a58988b65e7b78cbd7c509518c7baff7e">inout::li_i</a></div><div class="ttdeci">uintidx li_i</div><div class="ttdef"><b>Definition:</b> <a href="inparamclustering__getparameter_8hpp_source.html#l00503">inparamclustering_getparameter.hpp:503</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a577db26950759fc5f50f6af3a485554f"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a577db26950759fc5f50f6af3a485554f">graph::AlgorithmsDFS::dfs_visit</a></div><div class="ttdeci">void dfs_visit(uintidx aiui_vertexU)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00097">graph_utils.hpp:97</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_aca064b7deac719e1fa762908ea080d03"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#aca064b7deac719e1fa762908ea080d03">graph::AlgorithmsDFSAdjMatrix::d</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; d</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00277">graph_utils.hpp:277</a></div></div>
<div class="ttc" id="classdata_1_1_instance_html_a90d1eaeb66cc1470bbfdb95434fdb761"><div class="ttname"><a href="classdata_1_1_instance.html#a90d1eaeb66cc1470bbfdb95434fdb761">data::Instance::getNumDimensions</a></div><div class="ttdeci">static uintidx getNumDimensions()</div><div class="ttdef"><b>Definition:</b> <a href="instance_8hpp_source.html#l00145">instance.hpp:145</a></div></div>
<div class="ttc" id="common_8hpp_html"><div class="ttname"><a href="common_8hpp.html">common.hpp</a></div><div class="ttdoc">common</div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a1d08c0e3528b828a92f39a03d290f0f9"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a1d08c0e3528b828a92f39a03d290f0f9">graph::AlgorithmsDFSAdjMatrix::getPi</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; &amp; getPi()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00254">graph_utils.hpp:254</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_aa542e2888e73a268e35891bdfc8e6ca5"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#aa542e2888e73a268e35891bdfc8e6ca5">graph::AlgorithmsDFS::d</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; d</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00181">graph_utils.hpp:181</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a2218b5467e8c8ac1b655bf758c501628"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a2218b5467e8c8ac1b655bf758c501628">graph::AlgorithmsDFS::getVertexReachable</a></div><div class="ttdeci">std::list&lt; uintidx &gt; getVertexReachable(uintidx aiui_vertexU)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00122">graph_utils.hpp:122</a></div></div>
<div class="ttc" id="namespacegraph_html_ab591fce56dc3e3d8a23f517cc4a55190"><div class="ttname"><a href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">graph::fromPiToGraph</a></div><div class="ttdeci">std::vector&lt; std::list&lt; T_VERTEX_IDX &gt; &gt; fromPiToGraph(const std::vector&lt; T_VERTEX_IDX &gt; &amp;aivectorvertexidx_pi)</div><div class="ttdoc">Constructs a vector list graph from PI vertices for a Pi vector.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00355">graph_utils.hpp:355</a></div></div>
<div class="ttc" id="disjsets_8hpp_html"><div class="ttname"><a href="disjsets_8hpp.html">disjsets.hpp</a></div><div class="ttdoc">disjoint sets</div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a2719f4a788cf7c91e7dfad11bdb727f5"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a2719f4a788cf7c91e7dfad11bdb727f5">graph::AlgorithmsDFSAdjMatrix::resolve</a></div><div class="ttdeci">void resolve()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00207">graph_utils.hpp:207</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_ac11fe10fb098b1975b6c28aae8eee43d"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac11fe10fb098b1975b6c28aae8eee43d">graph::AlgorithmsDFSAdjMatrix::_vectorenum_color</a></div><div class="ttdeci">std::vector&lt; GraphStateVertex &gt; _vectorenum_color</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00271">graph_utils.hpp:271</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_acd9fb7e8c9213926e491ccf938bd957e"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#acd9fb7e8c9213926e491ccf938bd957e">graph::AlgorithmsDFSAdjMatrix::~AlgorithmsDFSAdjMatrix</a></div><div class="ttdeci">~AlgorithmsDFSAdjMatrix()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00205">graph_utils.hpp:205</a></div></div>
<div class="ttc" id="classds_1_1_disj_sets_html_a3eddb5e3a2f942314524d5f0edf181f0"><div class="ttname"><a href="classds_1_1_disj_sets.html#a3eddb5e3a2f942314524d5f0edf181f0">ds::DisjSets::print</a></div><div class="ttdeci">void print(std::ostream &amp;os=std::cout, const char *aipc_label=&quot;&quot;, const char aic_delimCoef=',') const</div><div class="ttdef"><b>Definition:</b> <a href="disjsets_8hpp_source.html#l00152">disjsets.hpp:152</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_ac3133ac1d7ab2dcff7c698cee718dc1d"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#ac3133ac1d7ab2dcff7c698cee718dc1d">graph::AlgorithmsDFS::_vectorlistadj_g</a></div><div class="ttdeci">std::vector&lt; std::list&lt; uintidx &gt; &gt; &amp; _vectorlistadj_g</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00173">graph_utils.hpp:173</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a349e75b5609dec53d3c7d51e905db91a"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a349e75b5609dec53d3c7d51e905db91a">graph::AlgorithmsDFS::_vectorenum_color</a></div><div class="ttdeci">std::vector&lt; GraphStateVertex &gt; _vectorenum_color</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00175">graph_utils.hpp:175</a></div></div>
<div class="ttc" id="namespacegraph_html"><div class="ttname"><a href="namespacegraph.html">graph</a></div><div class="ttdoc">Algorithms and utilities for graphs.</div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_ac495ab3d45479f2601c76d4648f556ef"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#ac495ab3d45479f2601c76d4648f556ef">graph::AlgorithmsDFSAdjMatrix::dfs_visit</a></div><div class="ttdeci">void dfs_visit(uintidx aiui_vertexU)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00229">graph_utils.hpp:229</a></div></div>
<div class="ttc" id="structdist_1_1_dist_html"><div class="ttname"><a href="structdist_1_1_dist.html">dist::Dist</a></div><div class="ttdoc">Generic dist.</div><div class="ttdef"><b>Definition:</b> <a href="dist_8hpp_source.html#l00034">dist.hpp:34</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a8c85f7e1dab1cedd4fc951fd424d28bb"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a8c85f7e1dab1cedd4fc951fd424d28bb">graph::AlgorithmsDFSAdjMatrix::print</a></div><div class="ttdeci">void print()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00260">graph_utils.hpp:260</a></div></div>
<div class="ttc" id="insertion__operator_8hpp_html"><div class="ttname"><a href="insertion__operator_8hpp.html">insertion_operator.hpp</a></div><div class="ttdoc">insertion operator</div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a00ad2bd569078a26fdeafa39ec07bcf6"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a00ad2bd569078a26fdeafa39ec07bcf6">graph::AlgorithmsDFS::resolve</a></div><div class="ttdeci">void resolve()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00065">graph_utils.hpp:65</a></div></div>
<div class="ttc" id="namespacegraph_html_a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275"><div class="ttname"><a href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275">graph::VERTEXSTATE_BLACK</a></div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00043">graph_utils.hpp:43</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_abe1b25e993493e8a7d7afeeda47e9680"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#abe1b25e993493e8a7d7afeeda47e9680">graph::AlgorithmsDFS::resolve</a></div><div class="ttdeci">void resolve(uintidx aiui_vertexU)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00081">graph_utils.hpp:81</a></div></div>
<div class="ttc" id="classds_1_1_bit_container_html_ac411be8a6a028077107ab9c7a60b5546"><div class="ttname"><a href="classds_1_1_bit_container.html#ac411be8a6a028077107ab9c7a60b5546">ds::BitContainer::getBit</a></div><div class="ttdeci">bool getBit(uintidx i) const</div><div class="ttdef"><b>Definition:</b> <a href="bit__container_8hpp_source.html#l00224">bit_container.hpp:224</a></div></div>
<div class="ttc" id="verbose__global_8hpp_html"><div class="ttname"><a href="verbose__global_8hpp.html">verbose_global.hpp</a></div><div class="ttdoc">verbose global</div></div>
<div class="ttc" id="instance_8hpp_html"><div class="ttname"><a href="instance_8hpp.html">instance.hpp</a></div><div class="ttdoc">Module for the handling of instances or also called objects or points.</div></div>
<div class="ttc" id="matrix__triangular_8hpp_html"><div class="ttname"><a href="matrix__triangular_8hpp.html">matrix_triangular.hpp</a></div><div class="ttdoc">matrix triangular</div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html">graph::AlgorithmsDFSAdjMatrix</a></div><div class="ttdoc">Depth-first search algorithms for a matrix of bits.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00193">graph_utils.hpp:193</a></div></div>
<div class="ttc" id="classmat_1_1_matrix_triang_html_ae8e385b7959c85519692bdee1d4c3aed"><div class="ttname"><a href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">mat::MatrixTriang::getNumRows</a></div><div class="ttdeci">const uintidx getNumRows() const</div><div class="ttdef"><b>Definition:</b> <a href="matrix__triangular_8hpp_source.html#l00128">matrix_triangular.hpp:128</a></div></div>
<div class="ttc" id="namespacegraph_html_a5f47c42addb98405452bb52f5c6599bc"><div class="ttname"><a href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">graph::component</a></div><div class="ttdeci">ds::DisjSets component(const std::vector&lt; uintidx &gt; &amp;aivectoruintidx_vertexPi)</div><div class="ttdoc">Find connected component of a graph.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00467">graph_utils.hpp:467</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a9f4f60b91180462e41c623a6a788c771"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a9f4f60b91180462e41c623a6a788c771">graph::AlgorithmsDFS::AlgorithmsDFS</a></div><div class="ttdeci">AlgorithmsDFS(std::vector&lt; std::list&lt; uintidx &gt; &gt; &amp;aivectorlistadj_g)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00053">graph_utils.hpp:53</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html_a80e1be25ca50e5fbcd02a6f80c92e5cf"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html#a80e1be25ca50e5fbcd02a6f80c92e5cf">graph::AlgorithmsDFS::~AlgorithmsDFS</a></div><div class="ttdeci">~AlgorithmsDFS()</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00063">graph_utils.hpp:63</a></div></div>
<div class="ttc" id="classds_1_1_disj_sets_html"><div class="ttname"><a href="classds_1_1_disj_sets.html">ds::DisjSets</a></div><div class="ttdoc">Disjoint-set.</div><div class="ttdef"><b>Definition:</b> <a href="disjsets_8hpp_source.html#l00036">disjsets.hpp:36</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_adj_matrix_html_a181e559b031a01c20f1c251c05573108"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#a181e559b031a01c20f1c251c05573108">graph::AlgorithmsDFSAdjMatrix::_vectorvertexidx_pi</a></div><div class="ttdeci">std::vector&lt; uintidx &gt; _vectorvertexidx_pi</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00273">graph_utils.hpp:273</a></div></div>
<div class="ttc" id="classds_1_1_disj_sets_html_a045884be5b69816578fd42500ec91ebd"><div class="ttname"><a href="classds_1_1_disj_sets.html#a045884be5b69816578fd42500ec91ebd">ds::DisjSets::merge</a></div><div class="ttdeci">void merge(uintidx x, uintidx y)</div><div class="ttdef"><b>Definition:</b> <a href="disjsets_8hpp_source.html#l00135">disjsets.hpp:135</a></div></div>
<div class="ttc" id="classmat_1_1_matrix_triang_html"><div class="ttname"><a href="classmat_1_1_matrix_triang.html">mat::MatrixTriang</a></div><div class="ttdoc">MatrixTriang.</div><div class="ttdef"><b>Definition:</b> <a href="matrix__triangular_8hpp_source.html#l00037">matrix_triangular.hpp:37</a></div></div>
<div class="ttc" id="namespacegraph_html_a1a8c03e25337e6becb8d58b8e57e66fc"><div class="ttname"><a href="namespacegraph.html#a1a8c03e25337e6becb8d58b8e57e66fc">graph::getAdjacencyMatrix</a></div><div class="ttdeci">mat::BitMatrix&lt; T_BITSIZE &gt; getAdjacencyMatrix(const T_DIST ait_distAdj, INPUT_ITERATOR aiiterator_instfirst, const INPUT_ITERATOR aiiterator_instlast, dist::Dist&lt; T_DIST, T_FEATURE &gt; &amp;aifunc2p_dist, const T_BITSIZE aii_datatypeBitSize=0)</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00694">graph_utils.hpp:694</a></div></div>
<div class="ttc" id="classds_1_1_disj_sets_html_a101eabf86f8a7f2e21f2c5c5329269eb"><div class="ttname"><a href="classds_1_1_disj_sets.html#a101eabf86f8a7f2e21f2c5c5329269eb">ds::DisjSets::find</a></div><div class="ttdeci">uintidx find(uintidx x)</div><div class="ttdef"><b>Definition:</b> <a href="disjsets_8hpp_source.html#l00118">disjsets.hpp:118</a></div></div>
<div class="ttc" id="namespacegraph_html_a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0"><div class="ttname"><a href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">graph::VERTEXSTATE_WHITE</a></div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00043">graph_utils.hpp:43</a></div></div>
<div class="ttc" id="classgraph_1_1_algorithms_d_f_s_html"><div class="ttname"><a href="classgraph_1_1_algorithms_d_f_s.html">graph::AlgorithmsDFS</a></div><div class="ttdoc">Depth-first search algorithms.</div><div class="ttdef"><b>Definition:</b> <a href="graph__utils_8hpp_source.html#l00050">graph_utils.hpp:50</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Apr 19 2019 08:58:31 for Library Evolutionary Algorithms for Clustering (LEAC) by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
